Multibody Grouping via Orthogonal Subspace Decomposition
نویسندگان
چکیده
Multibody structure f rom motion could be solved by the factorization approach. However, the noise measurements would make the segmentation daficult when analyzing the shape interaction matrix. This paper presents an orthogonal subspace decomposition and grouping technique t o approach such a problem. W e decompose the object shape spaces into signal subspaces and noise subspaces. W e show that the signal subspaces of the object shape spaces are orthogonal t o each other. Instead of using the shape interaction matrix contaminated by noise, we introduce the shape signal subspace distance matrix for shape space grouping. Outliers could be easily identified by this approach. The robustness of the proposed approach lies in the fact that the shape space decomposition alleviates the influence of noise, and has been verzfied with extensive experiments.
منابع مشابه
Robust and Efficient Subspace Segmentation via Least Squares Regression
This paper studies the subspace segmentation problem which aims to segment data drawn from a union of multiple linear subspaces. Recent works by using sparse representation, low rank representation and their extensions attract much attention. If the subspaces from which the data drawn are independent or orthogonal, they are able to obtain a block diagonal affinity matrix, which usually leads to...
متن کاملParallel Domain Decomposition Methods for Stochastic Elliptic Equations
We present parallel Schwarz type domain decomposition preconditioned recycling Krylov subspace methods for the numerical solution of stochastic elliptic problems, whose coefficients are assumed to be a random field with finite variance. Karhunen-Loève (KL) expansion and double orthogonal polynomials are used to reformulate the stochastic elliptic problem into a large number of related, but unco...
متن کاملOn Skew-Symmetric Games
By resorting to the vector space structure of finite games, skew-symmetric games (SSGs) are proposed and investigated as a natural subspace of finite games. First of all, for two player games, it is shown that the skew-symmetric games form an orthogonal complement of the symmetric games. Then for a general SSG its linear representation is given, which can be used to verify whether a finite game...
متن کاملModelling Decision Problems Via Birkhoff Polyhedra
A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours ...
متن کاملSignal Subspace Methods for Delay Estimation in Wireless Cdma Systems
We consider the problem of delay estimation in an asyn-chronous wireless CDMA communication system. The received observations are decomposed into orthogonal signal and noise subspaces via the singular value decomposition (SVD). A class of techniques known as subspace tting techniques is used to estimate the individual user delays by maximizingthe t between the signal subspace and the observed d...
متن کامل